Multivalued Boolean Satisfiability: MV-SAT
نویسنده
چکیده
Binary boolean satisfiability (SAT) has its applications in nearly all aspects of electronic design automation. Recent advances made by research in multivalued logic, rather than binary (2-valued) logic, suggest that extending binary SAT into the multivalued domain may allow us to efficiently solve many new problems that arise from such research. This paper presents a first look at a possible “MV-SAT” implementation in software and results are presented.
منابع مشابه
Solving Many-Valued SAT Encodings with Local Search
In this paper we present MV-SAT, which is a many-valued constraint programming language that bridges the gap between Boolean Satisfiability and Constraint Satisfaction. Our overall goal is to extend the SAT formalism with many-valued sets and deal with more compact and natural encodings, as in CSP approaches, while retaining the efficiencies of SAT solvers operating on uniform encodings. After ...
متن کاملA General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT
Jain et al. [4] recently introduced a new no-good learning approach for multivalued satisfaction (MV-SAT) problems. This approach was shown to infer significantly stronger no-goods than those inferred by a mechanism that is based on a Boolean representation of a multi-valued problem as a SAT instance. Like earlier methods, the learning approach is based on an implication graph where nodes repre...
متن کاملGenetic-fuzzy approach to the Boolean satisfiability problem
Witold Pedrycz, Giancarlo Succi, and Ofer Shai Owing to the immense size of the search space in the SAT problem, evolutionary computing arises as a viable and attractive option. The objective of this study is to formulate the SAT problem in the evolutionary setting and carry out comprehensive xperimental studies. The approach relies on the embedding principle: we generalize the Boolean problem ...
متن کاملSatisfiability: where Theory meets Practice∗
Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook [4]. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense...
متن کاملA Constant Complexity Algorithm for Solving the Boolean Satisfiability Problem on Quantum Computers
In this paper we will present an algorithm for solving the Boolean satisfiability problem (SAT) or (K-SAT) on quantum computers, which runs in a constant number of steps; O(4), with any given number n of Boolean variables. We will show that in contrast to classical algorithms the ability of the algorithm to solve the problem increases as the number of variables increases.
متن کامل